Small obstacle asymptotics for a 2D semi-linear convex problem
نویسندگان
چکیده
منابع مشابه
Small obstacle asymptotics for a 2D semi-linear convex problem
We study a 2D semi-linear equation in a domain with a small Dirichlet obstacle of size δ. Using the method of matched asymptotic expansions, we compute an asymptotic expansion of the solution as δ tends to zero. Its relevance is justified by proving a rigorous error estimate. Then we construct an approximate model, based on an equation set in the limit domain without the small obstacle, which p...
متن کاملOptimal Time-Space Tradeoff for the 2D Convex-Hull Problem
We revisit the read-only random-access model, in which the input array is read-only and a limited amount of workspace is allowed. Given a set of N two-dimensional points in a read-only input array and Θ(S) bits of extra workspace (where S ≥ lgN), we present an algorithm that runs in O(N/S + N lgS) time for constructing the convex hull formed by the given points. Following a lower bound for sort...
متن کاملA new solving approach for fuzzy multi-objective programming problem in uncertainty conditions by using semi-infinite linear programing
In practice, there are many problems which decision parameters are fuzzy numbers, and some kind of this problems are formulated as either possibilitic programming or multi-objective programming methods. In this paper, we consider a multi-objective programming problem with fuzzy data in constraints and introduce a new approach for solving these problems base on a combination of the multi-objecti...
متن کاملAsymptotics for Linear
We prove that partial sums of linear multiparameter stochastic processes can be represented as partial sums of independent innovations plus components that are uniformly of smaller order. This representation is exploited to establish functional central limit theorems and strong approximations for random fields.
متن کاملA Strategy for Non-strictly Convex Distance Transport Cost and the Obstacle Problem
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X, dN ) a possibly branching geodesic space. We show that under some assumptions on the transference plan we can reduce the transport problem to transport problems along family of geodesics. We introduce two assumptions on the transference plan π whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis
سال: 2017
ISSN: 0003-6811,1563-504X
DOI: 10.1080/00036811.2017.1295449